Disjoint empty disks supported by a point set
نویسندگان
چکیده
منابع مشابه
Disjoint empty disks supported by a point set
For a planar point-set P , let D(P ) be the minimum number of pairwise-disjoint empty disks such that each point in P lies on the boundary of some disk. Further define D(n) as the maximum of D(P ) over all n-element point sets. Hosono and Urabe recently conjectured that D(n) = ⌈n/2⌉. Here we show that D(n) ≥ n/2 + n/236 − O(√n) and thereby disprove this conjecture.
متن کاملCovering a bichromatic point set with two disjoint monochromatic disks
Let P be a set of n points in the plane in general position such that its elements are colored red or blue. We study the problem of finding two disjoint disks Dr and Db such that Dr covers only red points, Db covers only blue points, and the number of elements of P contained in Dr ∪ Db is maximized. We prove that this problem can be solved in O(n polylogn) time. We also present a randomized alg...
متن کاملOn covering of any point configuration by disjoint unit disks
We give a configuration of 53 points that cannot be covered by disjoint unit disks. This improves the previously known configuration of 55 points.
متن کاملCovering a Point Set by Two Disjoint Rectangles
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel bu...
متن کاملDisjoint empty convex pentagons in planar point sets
Harborth [Elemente der Mathematik, Vol. 33 (5), 116–118, 1978] proved that every set of 10 points in the plane, no three on a line, contains an empty convex pentagon. From this it follows that the number of disjoint empty convex pentagons in any set of n points in the plane is least ⌊ n 10 ⌋. In this paper we prove that every set of 19 points in the plane, no three on a line, contains two disjo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry
سال: 2013
ISSN: 0047-2468,1420-8997
DOI: 10.1007/s00022-013-0160-8